A High-Level Derivation of Global Search Algorithms (with Constraint Propagation)
نویسندگان
چکیده
In this paper we describe the formal derivation of a transportation scheduling algorithm. The algorithm is based on the concepts of global search and constraint propagation and was originally derived using Kids (Kestrel Interactive Development System). The emphasis in this paper is on clarity of the overall derivation and on expressing concepts at a level of abstraction that permits signiicant reuse of concepts, laws, inference patterns, etc.
منابع مشابه
Design and Implementation of a Graph-Based Constraint Model for Local Search
Local search has during the last years evolved into a powerful technique for solving large combinatorial problems, often outperforming complete algorithms. The classical approach for generic constraint solving in local search is to provide a set of primitive constraints, which in turn can be used to form more complex combinatorial structures. Unfortunately, for several combinatorial structures ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملAutomatic Construction of Constraint Propagators
The design of a constraint solver is certainly a complex task involving the combination of good search algorithms and efficient constraint propagation. The behavior of propagation functions for n-ary constraints rely usually on specialized graph algorithms which depend on the nature of the constraint and the level of consistency to be enforced. The design of an efficient algorithm usually requi...
متن کاملLooking Forward in Constraint Satisfaction Algorithms
Empirical evidence indicates that the most successful backtracking algorithms for solving constraint satisfaction problems do some level of forward constraint propagation. That is they check constraints against the as yet uninstantiated variables in the search tree. Two popular examples are the forward checking and maintaining arc-consistency algorithms. Although there is a growing body of empi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Sci. Comput. Program.
دوره 28 شماره
صفحات -
تاریخ انتشار 1997